Asymptotics of Polynomial Interpolation and the Bernstein Constants
نویسندگان
چکیده
Abstract It is well known that the interpolation error for $$\left| x\right| ^{\alpha },\alpha >0$$ x ? , > 0 in $$L_{\infty }\left[ -1,1\right] $$ L ? - 1 by Lagrange polynomials based on zeros of Chebyshev first kind can be represented its limiting form entire functions exponential type. In this paper, we establish new asymptotic bounds these quantities when $$\alpha tends to infinity. Moreover, present some explicit constructions near best approximation }$$ norm which are process. The resulting formulas possibly indicate a general approach towards structure associated Bernstein constants.
منابع مشابه
Lebesgue constants in polynomial interpolation
Lagrange interpolation is a classical method for approximating a continuous function by a polynomial that agrees with the function at a number of chosen points (the “nodes”). However, the accuracy of the approximation is greatly influenced by the location of these nodes. Now, a useful way to measure a given set of nodes to determine whether its Lagrange polynomials are likely to provide good ap...
متن کاملLebesgue functions and Lebesgue constants in polynomial interpolation
The Lebesgue constant is a valuable numerical instrument for linear interpolation because it provides a measure of how close the interpolant of a function is to the best polynomial approximant of the function. Moreover, if the interpolant is computed by using the Lagrange basis, then the Lebesgue constant also expresses the conditioning of the interpolation problem. In addition, many publicatio...
متن کاملProof of the Conjectures of Bernstein and Erdijs Concerning the Optimal Nodes for Polynomial Interpolation*
It is the purpose of this note to complete and extend the work of Kilgore [8] on the optimal nodes in polynomial interpolation. The problem is as follows. Consider the Banach space C[a, b] of continuous functions on the finite interval [a, b], with the usual norm lI,fi~ := max l.f'(x)l. nkxZ:h Throughout the paper, we take n to be a fixed integer, n 3 2. Corresponding to each point t in we cons...
متن کاملOn Bernstein Type Inequalities for Complex Polynomial
In this paper, we establish some Bernstein type inequalities for the complex polynomial. Our results constitute generalizations and refinements of some well-known polynomial inequalities.
متن کاملThe Trigonometric Polynomial Like Bernstein Polynomial
A symmetric basis of trigonometric polynomial space is presented. Based on the basis, symmetric trigonometric polynomial approximants like Bernstein polynomials are constructed. Two kinds of nodes are given to show that the trigonometric polynomial sequence is uniformly convergent. The convergence of the derivative of the trigonometric polynomials is shown. Trigonometric quasi-interpolants of r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Results in Mathematics
سال: 2021
ISSN: ['1420-9012', '1422-6383']
DOI: https://doi.org/10.1007/s00025-021-01408-3